Some extremal graphs with respect to inverse degree
نویسندگان
چکیده
منابع مشابه
On the extremal graphs with respect to bond incident degree indices
Many existing degree based topological indices can be clasified as bond incident degree (BID) indices, whose general form is BID(G) = ∑ uv∈E(G) Ψ(du, dv), where uv is the edge connecting the vertices u, v of the graph G, E(G) is the edge set of G, du is the degree of the vertex u and Ψ is a non-negative real valued (symmetric) function of du and dv. Here, it has been proven that if the extensio...
متن کاملExtremal (n,m)-Graphs with Respect to Distance-Degree-Based Topological Indices
In chemical graph theory, distance-degree-based topological indices are expressions of the form ∑ u6=v F (deg(u), deg(v)), d(u, v)), where F is a function, deg(u) the degree of u, and d(u, v) the distance between u and v. Setting F to be (deg(u) + deg(v))d(u, v), deg(u)deg(v)d(u, v), (deg(u)+deg(v))d(u, v)−1, and deg(u)deg(v)d(u, v)−1, we get the degree distance index DD, the Gutman index Gut, ...
متن کاملSIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کاملSome extremal unicyclic graphs with respect to Hosoya index and Merrifield-Simmons index
The Hosoya index of a graph is defined as the total number of the matchings, including the empty edge set, of the graph. The Merrifield-Simmons index of a graph is defined as the total number of the independent vertex sets, including the empty vertex set, of the graph. Let U(n,∆) be the set of connected unicyclic graphs of order n with maximum degree ∆. We consider the Hosoya indices and the Me...
متن کاملExtremal Unicyclic and Bicyclic Graphs with Respect to Harary Index
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this paper, we determined the extremal (maximal and minimal) unicyclic and bicyclic graphs with respect to Harary index. 2010 Mathematics Subject Classification: 05C90
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.09.004